Parameterized Heuristics for Incomplete Weighted CSPs
نویسندگان
چکیده
منابع مشابه
A Parameterized Local Consistency for Redundant Modeling in Weighted CSPs
The weighted constraint satisfaction problem (WCSP) framework is a soft constraint framework which can model many real life optimization or overconstrained problems. While there are many local consistency notions available to speed up WCSP solving, in this paper, we investigate how to effectively combine and channel mutually redundant WCSP models to increase constraint propagation. This success...
متن کاملComplexity and Approximability for Parameterized CSPs
The complexity of various Constraint Satisfaction Problems (CSP) when parameterized by structural measures (such as treewidth or clique-width) is a very well-investigated area. In this paper, we take a fresh look at such questions from the point of view of approximation, considering four standard CSP predicates: AND, OR, PARITY, and MAJORITY. By providing new or tighter hardness results for the...
متن کاملSoft Consistencies for Weighted CSPs
A number of local consistency properties have recently been defined for weighted CSPs. We split the consistency definitions into a component arising from the constraint tuples, and a component arising from the unary weights, and develop the idea of weight consistencies. The components are then combined again to produce different levels of soft consistency.
متن کاملModeling Robustness in CSPs as Weighted CSPs
Many real life problems come from uncertain and dynamic environments, where the initial constraints and/or domains may undergo changes. Thus, a solution found for the problem may become invalid later. Hence, searching for robust solutions for Constraint Satisfaction Problems (CSPs) becomes an important goal. In some cases, no knowledge about the uncertain and dynamic environment exits or it is ...
متن کاملDynamic heuristics for branch and bound search on tree-decomposition of Weighted CSPs
This paper deals with methods exploiting tree-decomposition approaches for solving weighted constraint networks. We consider here the practical efficiency of these approaches by defining five classes of variable orders more and more dynamic which preserve the time complexity bound. For that, we define extensions of this theoretical time complexity bound to increase the dynamic aspect of these o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.330110045